EA/G-GA for Single Machine Scheduling Problems with Earliness/Tardiness Costs
نویسندگان
چکیده
منابع مشابه
EA/G-GA for Single Machine Scheduling Problems with Earliness/Tardiness Costs
An Estimation of Distribution Algorithm (EDA), which depends on explicitly sampling mechanisms based on probabilistic models with information extracted from the parental solutions to generate new solutions, has constituted one of the major research areas in the field of evolutionary computation. The fact that no genetic operators are used in EDAs is a major characteristic differentiating EDAs f...
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملA Genetic Algorithm Enhanced by Dominance Properties for Single Machine Scheduling Problems with Setup Costs
This paper considers a single machine scheduling problem in which n jobs are to be processed and a machine setup time is required when the machine switches jobs from one to the other. All jobs have a common due date that has been predetermined using the median of the set of sequenced jobs. The objective is to find an optimal sequence of the set of n jobs to minimize the sum of the job’s setups ...
متن کاملSingle-machine scheduling with stepwise tardiness costs and release times
We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...
متن کاملSingle-machine scheduling with general costs under compound-type distributions
We investigate in this paper the problem of scheduling n jobs on a single machine with general stochastic cost functions, which involves the effects of stochastic due times, and with the stochastic processing times in a class of distributions, which covers the family of exponential distributions, the family of geometrical distributions and some other important distribution families as its speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2011
ISSN: 1099-4300
DOI: 10.3390/e13061152